A randomised approximation algorithm for the hitting set problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Parallel Approximation Hitting Set Algorithm for Gene Expression Analysis
With the recent DNA-microarray technology, it is possible to measure the expression levels of thousands of genes simultaneously in the same experiment. A genetic network is a model that describes how the expression level of each gene is affected by the expression levels of other genes in the network. Given the results of an experiment with n genes and m measures over time (m << n), we consider ...
متن کاملPacking-Based Approximation Algorithm for the k-Set Cover Problem
We present a packing-based approximation algorithm for the k-Set Cover problem. We introduce a new local search-based k-set packing heuristic, and call it Restricted k-Set Packing. We analyze its tight approximation ratio via a complicated combinatorial argument. Equipped with the Restricted k-Set Packing algorithm, our k-Set Cover algorithm is composed of the k-Set Packing heuristic [7] for k ...
متن کاملAn Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed. It is possible to install a single tool in every time unit. Once the entire subset Sj has been installed, job j can be processed instantly. The problem is to determine an order of job installations which minimizes th...
متن کاملOn the Hitting Set of Bundles Problem
Le problème de l’ensemble minimal de paquets (minimal hitting set of bundles problem ou HSB) est défini comme suit. On dispose d’un ensemble E = {e1, e2, . . . , en} de n éléments. Chaque élément ei (i = 1, . . . , n) a un coût positif ou nul ci. Un paquet b est un sous ensemble de E . On dispose aussi d’une collection S = {S1, S2, . . . , Sm} de m ensembles de paquets. De manière plus précise,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.03.029